Influence Learning and Maximization

نویسندگان

چکیده

The problem of maximizing or minimizing the spreading in a social network has become more timely than ever with advent fake news and coronavirus epidemic. solution to this pertains influence maximization algorithms that identify right nodes lockdown for epidemic containment, hire viral marketing campaigns, block online political propaganda etc. Though these have been developed many years, majority literature focuses on scalability issues relaxing method’s assumptions. In recent emergence new complementary data advanced machine learning methods decision guided part towards learning-based approaches. These can range from how information spreads over network, solve combinatorial optimization itself. tutorial, we aim dissentangle clearly define different tasks around applications networks. More specifically, start traditional algorithms, describe need estimation delineate state-of-the-art diffusion learning. Subsequently, delve into while optimizing which is based algorithms. Finally, latest approaches graph neural networks deep reinforcement

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model-Independent Online Learning for Influence Maximization

We consider influence maximization (IM) in social networks, which is the problem of maximizing the number of users that become aware of a product by selecting a set of “seed” users to expose the product to. While prior work assumes a known model of information diffusion, we propose a novel parametrization that not only makes our framework agnostic to the underlying diffusion model, but also sta...

متن کامل

Influence Maximization in Social Networks using Learning Automata

Influence maximization problem is one of the challenges in online social networks. This problem refers to finding a small set of members of a social network, by activation of whichinformation propagation can be maximized using one of the propagation models such as independent cascade model. For the maximization problem, the greedy algorithm has beenpresented which isclose to optimal response by...

متن کامل

Timed Influence: Computation and Maximization

We consider a cost model for diffusion in a network that capturesboth the scope of infection and its propagation time: The edgesof the network have associated lengths which model transmissiontimes, and influence scores are higher for faster propagation. Wepropose an intuitive measure of timed influence, which extends andunifies several classic measures, including the well-st...

متن کامل

Handout: Influence Maximization

The study of social processes by which ideas and innovations diffuse through social networks has been ongoing for more than half a century and as a result a fair understanding of such processes has been achieved. Modern models of social influence have been augmented with various features allowing for arbitrary network structure, non-uniform interactions, probabilistic events and other aspects. ...

متن کامل

Evolving Influence Maximization

Influence Maximization (IM) aims to maximize the number of people that become aware of a product by finding the ‘best’ set of ‘seed’ users to initiate the product advertisement. Unlike prior arts on static social networks containing fixed number of users, we undertake the first study of IM in more realistic evolving networks with temporally growing topology. The task of evolving IM (EIM), howev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-74296-6_48